WORST_CASE(?,O(n^1))

Solution:
---------

  "++" :: ["A"(7) x "A"(7)] -(7)-> "A"(7)
  "++" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "merge" :: ["A"(7) x "A"(7)] -(2)-> "A"(0)
  "nil" :: [] -(0)-> "A"(7)
  "u" :: [] -(0)-> "A"(7)
  "u" :: [] -(0)-> "A"(15)
  "u" :: [] -(0)-> "A"(12)
  "v" :: [] -(0)-> "A"(7)
  "v" :: [] -(0)-> "A"(15)


Cost Free Signatures:
---------------------

  "++" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "merge" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "nil" :: [] -(0)-> "A"_cf(0)
  "u" :: [] -(0)-> "A"_cf(0)
  "v" :: [] -(0)-> "A"_cf(0)


Base Constructors:
------------------
  "\"++\"_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
  "\"nil\"_A" :: [] -(0)-> "A"(1)
  "\"u\"_A" :: [] -(0)-> "A"(1)
  "\"v\"_A" :: [] -(0)-> "A"(1)